Low degree equations for phylogenetic group-based models
نویسندگان
چکیده
منابع مشابه
Low Degree Equations for Phylogenetic Group-based Models
Motivated by phylogenetics, our aim is to obtain a system of low degree equations that define a phylogenetic variety on an open set containing the biologically meaningful points. In this paper we consider phylogenetic varieties defined via group-based models. For any finite abelian group G, we provide an explicit construction of codimX polynomial equations (phylogenetic invariants) of degree at...
متن کاملConstructive degree bounds for group-based models
Group-based models arise in algebraic statistics while studying evolution processes. They are represented by embedded toric algebraic varieties. Both from the theoretical and applied point of view one is interested in determining the ideals defining the varieties. Conjectural bounds on the degree in which these ideals are generated were given by Sturmfels and Sullivant [SS05, Conjectures 29, 30...
متن کاملLocal description of phylogenetic group-based models
Motivated by phylogenetics, our aim is to obtain a system of equations that define a phylogenetic variety on an open set containing the biologically meaningful points. In this paper we consider phylogenetic varieties defined via group-based models. For any finite abelian group G, we provide an explicit construction of codimX phylogenetic invariants (polynomial equations) of degree at most |G| t...
متن کاملSolving Simultaneous Modular Equations of Low Degree
We consider the problem of solving systems of equations Pi(x) 0 (mod ni) i = 1 : : : k where Pi are polynomials of degree d and the ni are distinct relatively prime numbers and x < min(ni). We prove that if k > d(d+1) 2 we can recover x in polynomial time provided min(ni) > 2 d . As a consequence the RSA cryptosystem used with a small exponent is not a good choice to use as a public key cryptos...
متن کاملOn the Existence of low-degree Equations for Algebraic Attacks
Algebraic attacks on block ciphers and stream ciphers have gained more and more attention in cryptography. The idea is to express a cipher by a system of equations whose solution reveals the secret key. The complexity of an algebraic attack is closely related to the degree of the equations. Hence, low-degree equations are crucial for algebraic attacks. So far, the existence of low-degree equati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Collectanea Mathematica
سال: 2014
ISSN: 0010-0757,2038-4815
DOI: 10.1007/s13348-014-0120-0